Risk-Based Attack Surface Approximation
نویسنده
چکیده
In our increasingly interconnected world, software security is an increasingly important issue for development teams. However, there is too much security work to do for these teams as security needs have out-scaled security resources. To help prioritize security efforts, professionals use the attack surface of a system, or the sum of all paths for untrusted data into and out of a system, to identify security relevant code. However, identifying code that lies on the attack surface is a difficult and resource-intensive process. Our research proposes the use of crash dump stack traces as an empirical metric for approximating the attack surface. We hypothesize that code that appears on crash dump stack traces represent activity that has put the system under stress, and is therefore indicative of potential security vulnerabilities. The goal of this research is to aid software engineers in prioritizing security efforts by approximating the attack surface of a system via crash dump stack trace analysis. In a trial on Mozilla Firefox, the risk-based attack surface approximation selected 15.8% of files and contained 73.6% of known vulnerabilities. Randomly sampling 10% of crash dump stack traces for inclusion in our analysis resulted in only 2.7% fewer known vulnerabilities included on our attack surface. Through our approach, we look to optimize effort for the security community in finding, fixing and preventing security vulnerabilities.
منابع مشابه
Attack Surface Prioritization with Crash Dump Stack Traces
Resource limitations often preclude security professionals from reviewing, testing, and fortifying an entire code base. Identifying metrics that enable prioritization of security efforts would help practitioners discover security issues more efficiently. Risk-Based Attack Surface Approximation (RASA) makes use of crash dump stack trace from a targeted software system to provide an estimated att...
متن کاملExtension of Cube Attack with Probabilistic Equations and its Application on Cryptanalysis of KATAN Cipher
Cube Attack is a successful case of Algebraic Attack. Cube Attack consists of two phases, linear equation extraction and solving the extracted equation system. Due to the high complexity of equation extraction phase in finding linear equations, we can extract nonlinear ones that could be approximated to linear equations with high probability. The probabilistic equations could be considered as l...
متن کاملCalculation of the Induced Charge Distribution on the Surface of a Metallic Nanoparticle Due to an Oscillating Dipole Using Discrete Dipole Approximation method
In this paper, the interaction between an oscillating dipole moment and a Silver nanoparticle has been studied. Our calculations are based on Mie scattering theory and discrete dipole approximation(DDA) method.At first, the resonance frequency due to excitingthe localized surface plasmons has been obtained using Mie scattering theory and then by exciting a dipole moment in theclose proximity of...
متن کاملTunable Plasmonic Nanoparticles Based on Prolate Spheroids
Metallic nanoparticles can exhibit very large optical extinction in the visible spectrum due to localized surface plasmon resonance. Spherical plasmonic nanoparticles have been the subject of numerous studies in recent years due to the fact that the scattering response of spheres can be analytically evaluated using Mie theory. However a major disadvantage of metallic spherical nanoparticles is ...
متن کاملAssessing Attack Surface with Component-Based Package Dependency
Package dependency has been considered in many vulnerability assessment systems. However, existing approaches are either coarse-grained and do not accurately reveal the influence and severity of vulnerabilities, or do not provide comprehensive (both incoming and outgoing) analysis of attack surface through package dependency. We propose a systematic approach of measuring attack surface exposed ...
متن کامل